A Tabulation Algorithm for Clp Revised Report
نویسنده
چکیده
Since its introduction in logic programming, tabulation has proven to a be powerful tool in many areas. The technique has been lifted to constraint extensions of Datalog and to constraint logic programming (CLP). In this abstract, we describe a new formulation of tabulation for CLP, directly designed towards an implementation on CLP systems. We illustrate the use of our algorithm by comparing the performance of our implementation with bottom-up evaluation for groundness analysis of logic programs.
منابع مشابه
Structural basis for the in vitro known acyl-depsipeptide 2 (ADEP2) inhibition to Clp 2 protease from Mycobacterium tuberculosis
Inhibition of Mycobacterium tuberculosis Clp 2 protease has emerged as an attractive therapeutic option for treatment. Acyldepsipeptides (ADEPs) is known as an inhibitor for Clp 2 protease. Therefore, it is of interest to document its affinity, enzyme activity and ADME profiles. We report the predicted binding affinity of all known Clp 2 inhibitors like IDR-10001 and IDR-10011 against Clp2 prot...
متن کاملBottom-Up Tree Acceptors
This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...
متن کاملA Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing
[1] Corresponding author e-mail: [email protected] [1] Corresponding author e-mail: [email protected] Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...
متن کاملGeneralized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction
We present an efficient procedure for cost-based abduction , which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algorithm-goal-driven bottom-up derivation, tabulation of the partial results , and agenda control mechanism-and report the results of the preliminary experiments, which show how these features improve the computational ef...
متن کاملA RPCL-CLP Architecture For Financial Time Series Forecasting
In this paper, we propose a new architecture by Rival Penalized Competitive Learning algorithm (RPCL) (Xu, Krzyzak and Oja, 1993) and Combined Linear Prediction method (CLP). The performance of RPCL-CLP is insensitive to the initial number of cluster nodes selected. Experimental results show that it is robust in longterm prediction for financial time series forecasting. 1 The work was supported...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007